Conditions for minimally tough graphs

Katona, Soltész, and Varga showed that no induced subgraph can be excluded from the class of minimally tough graphs. In this paper, we consider the opposite question, namely which induced subgraphs, if any, must necessarily be present in each minimally t-tough graph. Katona and Varga showed that for any rational number t∈(1/2,1], every minimally t-tough graph contains a hole. We complement this result by showing that for any rational number t>1, every minimally t-tough graph must contain either a hole or an induced subgraph isomorphic to the k-sun for some integer k≥3. We also show that for any rational number t>1/2, every minimally t-tough graph must contain either an induced 4-cycle, an induced 5-cycle, or two independent edges as an induced subgraph

Effect of Inflammatory Mediators Lipopolysaccharide and Lipoteichoic Acid on Iron Metabolism of Differentiated SH-SY5Y Cells Alters in the Presence of BV-2 Microglia

Lipopolysaccharide (LPS) and lipoteichoic acid (LTA), the Gram-negative and the Gram-positive bacterial cell wall components are important mediators of neuroinflammation in sepsis. LPS and LTA are potent activators of microglial cells which induce the production of various pro-inflammatory cytokines. It has been demonstrated that disturbance of iron homeostasis of the brain is one of the underlying causes of neuronal cell death but the mechanisms contributing to this process are still questionable. In the present study, we established monocultures of differentiated SH-SY5Y cells and co-cultures of differentiated SH-SY5Y cells and BV-2 microglia as neuronal model systems to selectively examine the effect of inflammatory mediators LPS and LTA on iron homeostasis of SH-SY5Y cells both in mono- and co-cultures. We monitored the IL-6 and TNFα secretions of the treated cells and determined the mRNA and protein levels of iron importers (transferrin receptor-1 and divalent metal transporter-1), and iron storing genes (ferritin heavy chain and mitochondrial ferritin). Moreover, we examined the relation between hepcidin secretion and intracellular iron content. Our data revealed that LPS and LTA triggered distinct responses in SH-SY5Y cells by differently changing the expressions of iron uptake, as well as cytosolic and mitochondrial iron storage proteins. Moreover, they increased the total iron contents of the cells but at different rates. The presence of BV-2 microglial cells influenced the reactions of SH-SY5Y cells on both LPS and LTA treatments: iron uptake and iron storage, as well as the neuronal cytokine production have been modulated. Our results demonstrate that BV-2 cells alter the iron metabolism of SH-SY5Y cells, they contribute to the iron accumulation of SH-SY5Y cells by manipulating the effects of LTA and LPS proving that microglia are important regulators of neuronal iron metabolism at neuroinflammation

A rapidly spreading potential pest, Orientus ishidae identified in Hungary

The present study reports the first data on the occurrence of the mosaic leafhopper, Orientus ishidae (Matsumura) (Hemiptera Cicadellidae), in Hungary. The species is of eastern Palaearctic origin and a few years after its first detection in the western Palaearctic it has been reported from several European countries. Recently the phytoplasma of Flavescence dorée has been identified from O. ishidae individuals collected in Italy and Slovenia. Due to the fast spread and possible economic importance of the species, attention needs to be called to monitoring of this possible pest of grapevines

Extremal Results for Graphs Avoiding a Rainbow Subgraph

We say that k graphs G1, G2, …, Gk on a common vertex set of size n contain a rainbow copy of a graph H if their union contains a copy of H with each edge belonging to a distinct Gi. We provide a counterexample to a conjecture of Frankl on the maximum product of the sizes of the edge sets of three graphs avoiding a rainbow triangle. We propose an alternative conjecture, which we prove under the additional assumption that the union of the three graphs is complete. Furthermore, we determine the maximum product of the sizes of the edge sets of three graphs or four graphs avoiding a rainbow path of length three. © The authors